Detectability of communities in heterogeneous networks
نویسندگان
چکیده
منابع مشابه
Detectability of communities in heterogeneous networks.
Communities are fundamental entities for the characterization of the structure of real networks. The standard approach to the identification of communities in networks is based on the optimization of a quality function known as modularity. Although modularity has been at the center of an intense research activity and many methods for its maximization have been proposed, not much is yet known ab...
متن کاملParticipation in Heterogeneous Communities
This paper studies what determines group formation and the degree of participation when the population is heterogeneous, both in terms of income and race or ethnicity. We are especially interested in whether and how much the degree of heterogeneity in communities influences the amount of participation in different types of groups. Using survey data on group membership and data on U. S. localiti...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملDetectability limits of epidemic sources in networks
The detection of an epidemic source or the patient zero is an important practical problem that can help in developing the epidemic control strategies. In this paper, we study the statistical inference problem of detecting the source of epidemics from a snapshot of a contagion spreading process at some time on an arbitrary network structure. By using exact analytic calculations and Monte Carlo s...
متن کاملStochastic fluctuations and the detectability limit of network communities
We have analyzed the detectability limits of network communities in the framework of the popular Girvan and Newman benchmark. By carefully taking into account the inevitable stochastic fluctuations that affect the construction of each and every instance of the benchmark, we come to the conclusion that the native, putative partition of the network is completely lost even before the in-degree/out...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2013
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.88.010801